Speeding up Statistical Tolerance Analysis to Real Time

نویسندگان

چکیده

Statistical tolerance analysis based on Monte Carlo simulation can be applied to obtain a cost-optimized specification that satisfies both the cost and quality requirements associated with manufacturing. However, this process requires time-consuming computations. We found an implementation uses graphics processing unit (GPU) for vector-chain-based statistical scales better increasing sample size than similar central (CPU). Furthermore, we identified significant potential reducing runtime by using array vectorization NumPy, proper selection of row- column- major order, use single precision floating-point numbers GPU implementation. In conclusion, present open source synthesis approaches Python used improve existing workflows real time regular desktop computers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding up the Convergence of Real-Time Search

Learning Real-Time A* (LRTA*) is a real-time search method that makes decisions fast and still converges to a shortest path when it solves the same planning task repeatedly. In this paper, we propose new methods to speed up its convergence. We show that LRTA* often converges significantly faster when it breaks ties towards successors with smallest f-values (a la A*) and even faster when it move...

متن کامل

Speeding Up the Response-Time Analysis of Tasks with Offsets

We present a method that enables an efficient implementation of the approximative response-time analysis for tasks with offsets presented by Tindell [11] and Palencia Gutierrez et al. [6]. The method allows for significantly faster implementations of schedulability tools. To have fast calculations of response-times is paramount in optimising tools that perform automatic configuration of systems...

متن کامل

Speeding Up Network Simulations Using Discrete Time

We develop a way of simulating disease spread in networks faster at the cost of some accuracy. Instead of a discrete event simulation (DES) we use a discrete time simulation. This aggregates events into time periods. We prove a bound on the accuracy attained. We also discuss the choice of step size and do an analytical comparison of the computational costs. Our error bound concept comes from th...

متن کامل

Speeding Up Reaction Time with Invisible Stimuli

Normal subjects react more quickly to a pair of visual stimuli than to a stimulus alone. This phenomenon is known as the redundant signal effect (RSE) and represents an example of divided visual attention in which signal processing is carried out in parallel to the advantage of response speed. A most interesting aspect of this phenomenon is that it can occur when one stimulus in a pair cannot b...

متن کامل

Speeding up Static Probabilistic Timing Analysis

Probabilistic Timing Analysis (PTA) has emerged recently to derive trustworthy and tight WCET estimates. Computational costs due to the use of the mathematical operator called convolution used by SPTA – the static variant of PTA – and also deployed in many domains including signal and image processing, jeopardize the scalability of SPTA to real-size programs. We evaluate, qualitatively and quan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2021

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app11094207